A Non-Regular Grobner Fan

Global optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory

Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...

On the computation of Hilbert series and Poincare series for algebras with infinite Grobner bases

In this paper we present algorithms to compute finite state automata which, given any rational language, recognize the languages of normal words and n-chains. We also show how these automata can be used to compute the Hilbert series and Poincaré series for any algebra with a rational set of leading words of its minimal Gröbner basis.

Alluvial fan facies of the Qazvin Plain: paleoclimate and tectonic implications during Quaternary

The present research focuses on a detailed facies description and interpretation of five alluvial fans of the Qazvin Plain. Beside the tectonic activity that leads to the localization of the fans on the northern margin of the Qazvin Plain, the climate has a significant role in the occurrence of their facies. The alluvial fans are divided into three facies groups: group 1, group 2, and group 3. ...

Systematic encoding via Grobner bases for a class of algebraic-geometric Goppa codes

Any linear code with a nontrivial automorphism has the structure of a module over a polynomial ring. The theory of Griihner bases for modules gives a compact description and implementation of a systematic encoder. We present examples of algebraic-geometric Goppa codes that can be encoded by these methods, including the one-point Hermitian codes. Index TermsSystematic encoding, algebraic-geometr...

On the Grobner Basis of a Family of Quasi-Cyclic LDPC Codes